\hypertarget{classgraph_1_1connect}{\section{graph\-:\-:connect$<$ \-T, container $>$ \-Class \-Template \-Reference}
\label{classgraph_1_1connect}\index{graph\-::connect$<$ T, container $>$@{graph\-::connect$<$ T, container $>$}}
}
\subsection*{\-Classes}
\begin{DoxyCompactItemize}
\item 
class \hyperlink{classgraph_1_1connect_1_1tarjan__visit}{tarjan\-\_\-visit}
\end{DoxyCompactItemize}
\subsection*{\-Public \-Types}
\begin{DoxyCompactItemize}
\item 
typedef std\-::pair$<$ \-T, \*
std\-::pair$<$ int, int $>$ $>$ \hyperlink{classgraph_1_1connect_a1d9995deb5eb3bdd3af6029e4e05f006}{dist\-\_\-vertex\-\_\-pair}
\item 
\hypertarget{classgraph_1_1connect_ada7741e4e782afd5d705835ae9db3d37}{typedef std\-::multimap$<$ \-T, \*
std\-::vector$<$ int $>$ $>$ {\bfseries span\-\_\-tree}}\label{classgraph_1_1connect_ada7741e4e782afd5d705835ae9db3d37}

\end{DoxyCompactItemize}
\subsection*{\-Public \-Member \-Functions}
\begin{DoxyCompactItemize}
\item 
\hypertarget{classgraph_1_1connect_a759b480314799e9bdb8334bb4ba12b6d}{{\bfseries connect} (container \&g)}\label{classgraph_1_1connect_a759b480314799e9bdb8334bb4ba12b6d}

\item 
\hypertarget{classgraph_1_1connect_a42905a30e8a3a3b3ce794026e5bb4b84}{span\-\_\-tree {\bfseries kruskal} ()}\label{classgraph_1_1connect_a42905a30e8a3a3b3ce794026e5bb4b84}

\item 
\hypertarget{classgraph_1_1connect_a51ff7bafbd8b90b86ff764a3f736f2fc}{void {\bfseries tarjan} (int u)}\label{classgraph_1_1connect_a51ff7bafbd8b90b86ff764a3f736f2fc}

\end{DoxyCompactItemize}
\subsubsection*{template$<$class T, class container = class adjacent\-\_\-graph$<$\-T$>$$>$ class graph\-::connect$<$ T, container $>$}



\subsection{\-Member \-Typedef \-Documentation}
\hypertarget{classgraph_1_1connect_a1d9995deb5eb3bdd3af6029e4e05f006}{\index{graph\-::connect@{graph\-::connect}!dist\-\_\-vertex\-\_\-pair@{dist\-\_\-vertex\-\_\-pair}}
\index{dist\-\_\-vertex\-\_\-pair@{dist\-\_\-vertex\-\_\-pair}!graph::connect@{graph\-::connect}}
\subsubsection[{dist\-\_\-vertex\-\_\-pair}]{\setlength{\rightskip}{0pt plus 5cm}template$<$class T , class container  = class adjacent\-\_\-graph$<$\-T$>$$>$ typedef std\-::pair$<$\-T,std\-::pair$<$int,int$>$ $>$ {\bf graph\-::connect}$<$ \-T, container $>$\-::{\bf dist\-\_\-vertex\-\_\-pair}}}\label{classgraph_1_1connect_a1d9995deb5eb3bdd3af6029e4e05f006}
\-Kruskal algorithm. \-Used to find minimal span tree. \-Best case is a single tree, otherwise it will return a forest. 

\-The documentation for this class was generated from the following file\-:\begin{DoxyCompactItemize}
\item 
graph/graph.\-h\end{DoxyCompactItemize}
